The single server semi-markov queue
نویسندگان
چکیده
منابع مشابه
A single-server queue with batch arrivals and semi-Markov services
We investigate the transient and stationary queue-length distributions of a class of service systems with correlated service times. The classical MX/G/1 queue with semi-Markov service times is the most prominent example in this class and serves as a vehicle to display our results. The sequence of service times is governed by a modulating process J(t). The state of J(·) at a service initiation t...
متن کاملA Single-Server Queue with Markov Modulated Service Times
We study a queueing system with a Poisson arrival process and Markov modulated, exponential service requirements. For a modulating Markov Chain with two states, we show that the distribution of the number-in-system is a superposition of two matrix-geometric series and provide a simple algorithm for computing the rate and coefficient matrices. These results hold for both finite and infinite wait...
متن کاملFINITE POPULATION SINGLE SERVER BATCH SERVICE QUEUE WITH COMPULSORY SERVER VACATION
A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.
متن کاملOn the Single-server Retrial Queue
In this work, we review the stochastic decomposition for the number of customers in M/G/1 retrial queues with reliable server and server subjected to breakdowns which has been the subject of investigation in the literature. Using the decomposition property of M/G/1 retrial queues with breakdowns that holds under exponential assumption for retrial times as an approximation in the non-exponential...
متن کاملOn a Single - Server Queue with Fixed Accumulation Level , State Dependent Service , and Semi - Markov Modulateo Input Flow
The authors study the queueing process in a single-server queueing system with state dependent service and with the input modulated by a semi-Markov process embedded in the queueing process. It is also assumed that the server capacity is r > 1 and that any service act will not begin until the queue accumulates at least r units. In this model, therefore, idle periods also depend upon the queue l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 1986
ISSN: 0304-4149
DOI: 10.1016/0304-4149(86)90112-2